Reuse of proofs in software verification
نویسندگان
چکیده
منابع مشابه
Reuse of Proofs in Software Verification
This paper sketches a method for automated reuse of proofs in software veriication. Proofs about programs as well as proof attempts are used to guide the veriication of modiied programs , particularly of program corrections. We illustrate the phenomenon of reusability, sketch the technical aspects, and report on our experiences with an implementation of this method in the Karlsruhe Interactive ...
متن کاملReuse of Proofs in Software
This paper presents a method for automated reuse of proofs in software veriication. Proofs about programs as well as proof attempts are used to guide the veriication of modiied programs, particularly of program corrections. We illustrate the phenomenon of reusability, present an evolutionary veriication process model and discuss theoretical and technical aspects. Finally, we report on case stud...
متن کاملReuse in Software Verification
A major obstacle facing adoption of formal software verification is the difficulty to track changes in the target code and to accomodate them in specifications and in verification arguments. We introduce abstract method calls, a new verification rule for method calls that can be used in most contract-based verification settings. By combining abstract method calls, structured reuse in specificat...
متن کاملSimilarities and Reuse of Proofs in Formal Software Veriication Similarities and Reuse of Proofs in Formal Software Veriication
The amount of user interaction is a prime cost factor in interactive program veriication. This paper analyzes situations in which the reuse of previous proofs can help reducing these costs. In particular , it describes a technique that reuses subproofs in the veriication of invariants of state transition systems. This technique replays decisions of generalized previous proof attempts from the s...
متن کاملPatching Proofs for Reuse
1 We investigate the application of machine learning paradigms in automated reasoning in order to improve a theorem prover by reusing previously computed proofs. Our reuse procedure generalizes a previously computed proof of a conjecture yielding a schematic proof which can be instantiated subsequently if a new, similar conjecture is given. We show that for exploiting the full exibility of seco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1996
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02745521